Matroid complexity and large inputs
نویسنده
چکیده
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems under this scheme appears to be highly dependent on the choice of input-type. We define an order on the various methods of description, and we show how this order acts upon ten types of input. We also show that under this approach several natural algorithmic problems for matroids are complete in classes thought not to be equal to P.
منابع مشابه
Query Complexity of Matroids
Let M be a bridgeless matroid on ground set {1, . . . , n} and fM : {0, 1} → {0, 1} be the indicator function of its independent sets. A folklore fact is that fM is evasive, i.e., D(fM) = n where D(f) denotes the deterministic decision tree complexity of f. Here we prove query complexity lower bounds for fM in three stronger query models: (a) D⊕(fM) = Ω(n), where D⊕(f) denotes the parity decisi...
متن کاملParallel Complexity for Matroid Intersection and Matroid Parity Problems
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid parity set) is called a basic matroid intersection (basic matroid parity set), if its size is the rank of the matroid. We present that enumerating all basic matroid intersections (basic matroid parity sets) is in NC, provided that there are polynomial bounded basic m...
متن کاملRecognizing Matroids
Let $E$ be a finite set and $\mathcal P$, $\mathcal S$, $\mathcal L$ three classes of subsets of $E$, and $r$ a function defined on $2^E$. In this paper, we give an algorithm for testing if the quadruple $(\mathcal P, \mathcal S, \mathcal L, r)$ is the locked structure of a given matroid, i.e., recognizing if $(\mathcal P, \mathcal S, \mathcal L, r)$ defines a matroid. This problem is intractab...
متن کاملThe Complexity of Maximum Matroid-Greedoid Intersection
The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP -hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. Also the corresponding approximation problem is shown NP -hard for certain approximation performance bounds. This is in contrast with the maximum matroid-matroid intersection ...
متن کاملOn Binary Matroid Minors and Applications to Data Storage over Small Fields
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008